Arrangements of Segments that Share Endpoints : Single

We provide new combinatorial bounds on the complexity of a face in an arrangement of segments in the plane. In particular, we show that the complexity of a single face in an arrangement of n line segments determined by h endpoints is O(h logh). While the previous upper bound, O(nn(n)), is tight for segments with distinct endpoints, it is far from being optimal when n = (h 2). Our result shows that, in a sense, the fundamental combinatorial complexity of a face arises not as a result of the number of segments, but rather as a result of the number of endpoints.